Smooth approximations

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Smooth Approximations

We prove that a Lipschitz (or uniformly continuous) mapping f : X → Y can be approximated by smooth Lipschitz (resp. uniformly continuous) mapping, if X is a separable Banach space admitting a smooth Lipschitz bump and either X or Y is a C(K) space (resp. super-reflexive space). As a corollary we obtain also smooth approximation of C1-smooth mappings together with their first derivatives.

متن کامل

Best Approximations by Smooth Functions

THEOREM 1.1 (U. Sattes). Let r > 2 and g E C[O, l]\B$,‘. Then f”EB$’ is a best approximation to g, in L” (such a best approximation necessari/J) exisrs) if and only if there exists a subinterual (a, /?) c IO. 1 I and a positilse integer M > r + 1 for which the following conditions hold (i) f”l,n.ll, is a Perfect spline of degree r with exactly) M ~ r -1 knots arzd I.f”““(s)l = I a. e. on [u,pI....

متن کامل

C-smooth Approximations of Lur Norms

Let X be a WCG Banach space admitting a Ck-Fréchet smooth norm. Then X admits an equivalent norm which is simultaneously C1-Fréchet smooth, LUR, and a uniform limit of Ck-Fréchet smooth norms. If X = C([0, α]), where α is an ordinal, then the same conclusion holds true with k =∞.

متن کامل

Smooth Low Degree Approximations of Polyhedra

We present efficient algorithms to construct both C1 and C 2 smooth meshes of cubic and quintic A-patches to approximate a given polyhedron P in three dimensions. The A~patch is a smooth and single-sheeted zero-contour patch of a trivariate polynomial in Bernstein-Bezier (BB) form defined within a tetrahedron. The smooth mesh constructions rely on a novel scheme to build an inner simplicial hul...

متن کامل

Optimal Approximations by Piecewise Smooth Functions and Associated Variational Problems

The purpose of this paper is to introduce and study the most basic properties of three new variational problems which are suggested by applications to computer vision. In computer vision, a fundamental problem is to appropriately decompose the domain R of a function g ( x , y) of two variables. To explain this problem, we have to start by describing the physical situation whch produces images: ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Functional Analysis

سال: 2010

ISSN: 0022-1236

DOI: 10.1016/j.jfa.2010.04.020